Explicit constructions of point sets and sequences with low discrepancy
نویسندگان
چکیده
In this talk we discuss explicit constructions of sequences with optimal $L_2$ discrepancy and explicit constructions of point sets with optimal $L_q$ discrepancy for $1 < q < \infty$. In 1954 Roth proved a lower bound for the $L_2$ discrepancy of finite point sets in the unit cube of arbitrary dimension. Later various authors extended Roth's result to lower bounds also for the $L_q$ discrepancy and for infinite sequences. While it was known already from the early 1980s on that Roth's lower bound is best possible in the order of magnitude, it was a longstanding open question to find explicit constructions of point sets and sequences with optimal order of $L_2$ discrepancy. This problem was solved by Chen and Skriganov in 2002 for finite point sets and recently Dick and Pillichshammer gave an explicit construction for infinite sequences. These constructions can also be extended to give optimal order of the $L_q$ discrepancy of finite point sets for $1 < q < \infty$.
منابع مشابه
Adelic constructions of low discrepancy sequences
In [Fr2,Skr], Frolov and Skriganov showed that low discrepancy point sets in the multidimensional unit cube [0, 1)s can be obtained from admissible lattices in Rs. In this paper,we get a similar result for the case of (Fq((x))). Then we combine this approach with Halton’s construction of low discrepancy sequences.
متن کاملGolden Ratio Sequences for Low-Discrepancy Sampling
Most classical constructions of low-discrepancy point sets are based on generalizations of the one-dimensional binary van der Corput sequence whose implementation requires non-trivial bit-operations. As an alternative we introduce the quasi-regular golden ratio sequences which are based on the fractional part of successive integer multiples of the golden ratio. By leveraging results from number...
متن کاملComponent-by-component construction of hybrid point sets based on Hammersley and lattice point sets
In a series of recent articles, such as, e.g., [5, 9, 16, 22], point sets mixed from integration node sets in different sorts of quasi-Monte Carlo rules have been studied. In particular, a finite version, based on Hammersley and lattice point sets, was introduced in [16], where the existence of such hybrid point sets with low star discrepancy was shown. However, up to now it has remained an ope...
متن کاملParallel Quasi-Monte Carlo Integration Using (t, s)-Sequences
Currently, the most eeective constructions of low-discrepancy point sets and sequences are based on the theory of (t; m; s)-nets and (t; s)-sequences. In this work we discuss parallelization techniques for quasi-Monte Carlo integration using (t; s)-sequences. We show that leapfrog parallelization may be very dangerous whereas block-based paral-lelization turns out to be robust.
متن کاملOn the L2-Discrepancy for Anchored Boxes
The L 2-discrepancy for anchored axis-parallel boxes has been used in several recent computational studies, mostly related to numerical integration, as a measure of the quality of uniform distribution of a given point set. We point out that if the number of points is not large enough in terms of the dimension (e.g., fewer than 10 4 points in dimension 30) then nearly the lowest possible L 2-dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014